package com.vint.mi;

import java.util.Arrays;
import java.util.zip.Checksum;

/**
 * 1.done
 *  乱序数组交换成正序，最少次数
 */
public class Mi24 {
    public static String solution(String line){
    	String[] src = line.split(",");
    	int[] a = new int[src.length];
    	for(int i=0;i<src.length;i++)a[i] = Integer.parseInt(src[i]);
	    Arrays.sort(a);
	    return line;
    }

    public static boolean isDraw(int[] a){
    	int sum = 0;
    	for(int i=0;i<a.length;i++)
		    sum+=a[i];
    	if(sum%2==1)return false;
    	sum /= 2;

    	return false;
    }


    public static void main(String[] args) {
	    System.out.println(solution("7"));
    }
}
